Effective on-line algorithms for reliable due date quotation and large-scale scheduling
نویسندگان
چکیده
منابع مشابه
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job’s arrival time, a due date must be quoted for the job, and the job must complete processing before its quoted due date. The objective is to minimize the sum (or average) of quoted due dates, or equivalently, the average quoted lead time. In this paper, we propose on-line heuristics for this p...
متن کاملCAREER: Scheduling of Large-Scale Systems: Probabilistic Analysis and Practical Algorithms for Due Date Quotation
We present a novel single facility due-date quotation model and algorithm, and characterize the effectiveness of this algorithm employing the tools of probabilistic analysis. This model is intended to be a building block for the models that we will use to analyze due date quotation in make-to-order supply chains, and we present a summary of these models.
متن کاملAnalysis of On-Line Algorithms for Due Date Quotation
We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic...
متن کاملOn-Line Algorithms for Due Date Quotation with Lateness Penalties
We present a novel model for due date quotation. Jobs arrive at a single server or m-machine flow shop over time. Upon arrival, the processing times on each machine of the job are known, and due dates must be quoted for each job. The jobs are sequenced on the machines without preemption. Associated with each job, there are three measures of disadvantages to the inventory cost and the service le...
متن کاملDue Date Quotation Models and Algorithms
When firms operate in a make-to-order environment, they must set due dates (or lead times) which are both relatively soon in the future and can be met reliably in order to compete effectively. This can be a difficult task, since there is clearly an inherent tradeoff between short due dates, and due dates that can be easily met. Nevertheless, the vast majority of due date scheduling research ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2008
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-008-0053-0